Two theorems of Jhon Bell and Communication Complexity

نویسنده

  • Guruprasad Kar
چکیده

John Bell taught us that quantum mechanics can not be reproduced by noncontextual and local Hidden variable theory. The impossibility of replacing quantum mechanics by non-contextual Hidden Variable Theory can be turned to a impossible coloring pseudo-telepathy game to be played by two distant players. The game can not be won without communication in the classical world. But if the players share entangled state (quantum correlation) the game can be won deterministically using no communication. This again shows that though quantum correlation can not be used for communication, two parties can not simulate quantum correlation without classical communication. The motivation of the article is to present the earlier works on Hidden Variable Theory and recently developed pseudo-telepathy problem in a simpler way, which may be helpful for the beginners in this area. Introduction Quantum mechanics is a mathematical theory to describe the physical world and at the same time it is a probabilistic theory. But this is not surprising. What is surprising, if we take Copenhagen interpretation for granted, is that this probability is not the probability of some dynamical variable having a particular value in some state, but that represents probability of finding a particular value if that dynamical variable is measured. This interpretation generated numerous debates and following

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Bell Inequalities from Communication Complexity

The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say a Bell inequality is normalized if its absolute value does not exceed 1 for any classical (i.e. local) distribution. Upper and (almost) tight lower bounds have been given in terms of number of outputs of the distribution, number of inputs, an...

متن کامل

Quantum Communication Complexity of Distributed Set Joins

Computing set joins of two inputs is a common task in database theory. Recently, Van Gucht, Williams, Woodruff and Zhang [PODS 2015] considered the complexity of such problems in the natural model of (classical) two-party communication complexity and obtained tight bounds for the complexity of several important distributed set joins. In this paper we initiate the study of the quantum communicat...

متن کامل

Quantum communication complexity advantage implies violation of a Bell inequality.

We obtain a general connection between a large quantum advantage in communication complexity and Bell nonlocality. We show that given any protocol offering a sufficiently large quantum advantage in communication complexity, there exists a way of obtaining measurement statistics that violate some Bell inequality. Our main tool is port-based teleportation. If the gap between quantum and classical...

متن کامل

On Rank vs. Communication Complexity

This paper concerns the open problem of Lovász and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems.

متن کامل

Connections, Communication and Collaboration in Healthcare’s Complex Adaptive Systems; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”

A more sophisticated understanding of the unpredictable, disorderly and unstable aspects of healthcare organisations is developing in the knowledge translation (KT) literature. In an article published in this journal, Kitson et al introduced a new model for KT in healthcare based on complexity theory. The Knowledge Translation Complexity Network Model (KTCNM) provides a fresh perspective by mak...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005